-
1 nondeterministic finite-state automaton
Техника: недетерминированный конечный автоматУниверсальный англо-русский словарь > nondeterministic finite-state automaton
-
2 automaton
- anthropomorphic automaton
- canonical parsing automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite state automaton
- finite-memory automaton
- halting automaton
- infinite automaton
- linear-bounded automaton
- Mealy automaton
- Moore automaton
- nondeterministic automaton
- parsing automaton
- partialy specific automaton
- probabilistic automaton
- push-down automaton
- reduced automaton
- reduced-time automaton
- redundant automaton
- self-adjusting automaton
- self-reproducing automaton
- semireduced parsing automaton
- split parsing automaton
- stochastic automaton
- timed automaton
- two-way automatonEnglish-Russian dictionary of computer science and programming > automaton
-
3 NDFA
-
4 NDFA
nondeterministic finite-state automaton - недетерминированный конечный автомат; НДКА -
5 NDFA
Вычислительная техника: nondeterministic finite-state automaton -
6 NDFA
сокр. от nondeterministic finite-state automatonнедетерминированный конечный автомат, НДКАEnglish-Russian dictionary of computer science and programming > NDFA
См. также в других словарях:
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Generalized nondeterministic finite state machine — In the theory of computation, a generalized nondeterministic finite state machine or generalized nondeterministic finite automaton (GNFA) is a NFA where each transition may be labeled with any regular expression. The GNFA reads blocks of symbols… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
State transition table — In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state … Wikipedia
Pushdown automaton — In automata theory, a pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data. Operation Pushdown automata differ from normal finite state machines in two ways: # They can use the top of the stack to decide… … Wikipedia
Büchi automaton — A Büchi automaton is the extension of a finite state automaton to infinite inputs. It accepts an infinite input sequence iff there exists a run of the automaton (in case of a deterministic automaton, there is exactly one possible run) which… … Wikipedia
Garden of Eden (cellular automaton) — An orphan pattern in Conway s Game of Life, discovered by R. Banks in 1971.[1] … Wikipedia